InforLorV4, Main, Exploration, bibRecord, 00B369

Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning

Identifieur interne : 00B369 ( Main/Exploration ); précédent : 00B368; suivant : 00B370

Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning

Auteurs : Malek Mouhoub [France] ; Francois Charpillet [France] ; Jean Paul Haton [France]

Source :

Constraints [ 1383-7133 ] ; 1998-06-01.

RBID : ISTEX:AFD626FF6AC2A61BD5AC9B215D237F6B8EFE5E92

Descripteurs français

Pascal (Inist)
- Algorithme, Backtracking, Calcul symbolique, Etude expérimentale, Intelligence artificielle, Logique temporelle, Représentation connaissances, Réseau ordinateur, Satisfaction contrainte, Système réparti, Théorie graphe.
Wicri :
- topic : Intelligence artificielle.

English descriptors

KwdEn :
- Algorithm, Artificial intelligence, Backtracking, Computer network, Constraint satisfaction, Distributed system, Experimental study, Graph theory, Knowledge representation, Symbolic computation, Temporal logic, arc consistency, constraint satisfaction, path consistency, temporal reasoning.

Abstract

Abstract: Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed a temporal model, TemPro, based on the interval Algebra, to express such applications in term of qualitative and quantitative temporal constraints. TemPro extends the interval algebra relations of Allen to handle numeric information. To solve a constraint satisfaction problem, different approaches have been developed. These approaches generally use constraint propagation to simplify the original problem and backtracking to directly search for possible solutions. The constraint propagation can also be used during the backtracking to improve the performance of the search. The objective of this paper is to assess different policies for finding if a TemPro network is consistent. The main question we want to answer here is “how much constraint propagation is useful” for finding a single solution for a TemPro constraint graph. For this purpose, we have experimented by randomly generating large consistent networks for which either arc and/or path consistency algorithms (AC-3, AC-7 and PC-2) were applied. The main result of this study is an optimal policy combining these algorithms either at the symbolic (Allen relation propagation) or at the numerical level.

Url:

https://api.istex.fr/ark:/67375/VQC-ZHJXSSPM-0/fulltext.pdf

DOI: 10.1023/A:1009769509401

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning</title>
<author><name sortKey="Mouhoub, Malek" sort="Mouhoub, Malek" uniqKey="Mouhoub M" first="Malek" last="Mouhoub">Malek Mouhoub</name>
</author>
<author><name sortKey="Charpillet, Francois" sort="Charpillet, Francois" uniqKey="Charpillet F" first="Francois" last="Charpillet">Francois Charpillet</name>
</author>
<author><name sortKey="Haton, Jean Paul" sort="Haton, Jean Paul" uniqKey="Haton J" first="Jean Paul" last="Haton">Jean Paul Haton</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:AFD626FF6AC2A61BD5AC9B215D237F6B8EFE5E92</idno>
<date when="1998" year="1998">1998</date>
<idno type="doi">10.1023/A:1009769509401</idno>
<idno type="url">https://api.istex.fr/ark:/67375/VQC-ZHJXSSPM-0/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002965</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002965</idno>
<idno type="wicri:Area/Istex/Curation">002929</idno>
<idno type="wicri:Area/Istex/Checkpoint">002601</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002601</idno>
<idno type="wicri:doubleKey">1383-7133:1998:Mouhoub M:experimental:analysis:of</idno>
<idno type="wicri:Area/Main/Merge">00BA91</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:99-0104068</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B46</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000D24</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000B52</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000B52</idno>
<idno type="wicri:doubleKey">1383-7133:1998:Mouhoub M:experimental:analysis:of</idno>
<idno type="wicri:Area/Main/Merge">00BB74</idno>
<idno type="wicri:Area/Main/Curation">00B369</idno>
<idno type="wicri:Area/Main/Exploration">00B369</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning</title>
<author><name sortKey="Mouhoub, Malek" sort="Mouhoub, Malek" uniqKey="Mouhoub M" first="Malek" last="Mouhoub">Malek Mouhoub</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>LORIA, BP 239, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Charpillet, Francois" sort="Charpillet, Francois" uniqKey="Charpillet F" first="Francois" last="Charpillet">Francois Charpillet</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>LORIA, BP 239, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Haton, Jean Paul" sort="Haton, Jean Paul" uniqKey="Haton J" first="Jean Paul" last="Haton">Jean Paul Haton</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>LORIA, BP 239, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Constraints</title>
<title level="j" type="abbrev">Constraints</title>
<idno type="ISSN">1383-7133</idno>
<idno type="eISSN">1572-9354</idno>
<imprint><publisher>Kluwer Academic Publishers</publisher>
<pubPlace>Boston</pubPlace>
<date type="published" when="1998-06-01">1998-06-01</date>
<biblScope unit="volume">3</biblScope>
<biblScope unit="issue">2-3</biblScope>
<biblScope unit="page" from="151">151</biblScope>
<biblScope unit="page" to="164">164</biblScope>
</imprint>
<idno type="ISSN">1383-7133</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">1383-7133</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Artificial intelligence</term>
<term>Backtracking</term>
<term>Computer network</term>
<term>Constraint satisfaction</term>
<term>Distributed system</term>
<term>Experimental study</term>
<term>Graph theory</term>
<term>Knowledge representation</term>
<term>Symbolic computation</term>
<term>Temporal logic</term>
<term>arc consistency</term>
<term>constraint satisfaction</term>
<term>path consistency</term>
<term>temporal reasoning</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme</term>
<term>Backtracking</term>
<term>Calcul symbolique</term>
<term>Etude expérimentale</term>
<term>Intelligence artificielle</term>
<term>Logique temporelle</term>
<term>Représentation connaissances</term>
<term>Réseau ordinateur</term>
<term>Satisfaction contrainte</term>
<term>Système réparti</term>
<term>Théorie graphe</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed a temporal model, TemPro, based on the interval Algebra, to express such applications in term of qualitative and quantitative temporal constraints. TemPro extends the interval algebra relations of Allen to handle numeric information. To solve a constraint satisfaction problem, different approaches have been developed. These approaches generally use constraint propagation to simplify the original problem and backtracking to directly search for possible solutions. The constraint propagation can also be used during the backtracking to improve the performance of the search. The objective of this paper is to assess different policies for finding if a TemPro network is consistent. The main question we want to answer here is “how much constraint propagation is useful” for finding a single solution for a TemPro constraint graph. For this purpose, we have experimented by randomly generating large consistent networks for which either arc and/or path consistency algorithms (AC-3, AC-7 and PC-2) were applied. The main result of this study is an optimal policy combining these algorithms either at the symbolic (Allen relation propagation) or at the numerical level.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Mouhoub, Malek" sort="Mouhoub, Malek" uniqKey="Mouhoub M" first="Malek" last="Mouhoub">Malek Mouhoub</name>
</region>
<name sortKey="Charpillet, Francois" sort="Charpillet, Francois" uniqKey="Charpillet F" first="Francois" last="Charpillet">Francois Charpillet</name>
<name sortKey="Haton, Jean Paul" sort="Haton, Jean Paul" uniqKey="Haton J" first="Jean Paul" last="Haton">Jean Paul Haton</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B369 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B369 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:AFD626FF6AC2A61BD5AC9B215D237F6B8EFE5E92
   |texte=   Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning

Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.